#define _CRT_SECURE_NO_WARNINGS 1


#include"BinarySearchTree.h"
#include<iostream>

using namespace std;

int main()
{
	int arr[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> bst1;
	for (auto& e : arr)
	{
		bst1.insert(e);
	}

	bst1.InOrder();

	cout << bst1.insert(16) << endl;
	bst1.InOrder();

	cout << bst1.insert(3) << endl;
	bst1.InOrder();

	cout << bst1.Find(6) << endl;
	cout << bst1.Find(5) << endl;

	return 0;
}